Efficiently Computing and Querying Multidimensional OLAP Data Cubes over Probabilistic Relational Data.

OLAP Over Uncertain and Imprecise Data Fundamental Issues and Novel Research Perspectives.

Balancing accuracy and privacy of OLAP aggregations on data cubes.

F%26A A Methodology for Effectively and Efficiently Designing Parallel Relational Data Warehouses on Heterogenous Database Clusters.

OLAP Data Cube Compression Techniques A Ten%2DYear%2DLong History.

Query Optimization over Parallel Relational Data Warehouses in Distributed Environments by Simultaneous Fragmentation and Allocation.

Effective Analysis of Flexible Collaboration Processes by Way of Abstraction and Mining Techniques.

A Process%2Ddriven Methodology for Modeling Service%2Doriented Complex Information Systems.

Optimizing Query Routing Trees in Wireless Sensor Networks.

Effectively and efficiently selecting access control rules on materialized views over relational databases.

Inheriting Access Control Rules from Large Relational Databases to Materialized Views Automatically.

A secure multiparty computation privacy preserving OLAP framework over distributed XML data.

A secure multiparty computation privacy preserving OLAP framework over distributed XML data.



Advanced knowledge%2Dbased systems.
Abstract: Natural language processing is a prerequisite for advanced knowledge-based systems since the ability to acquire, retrieve, exploit and present knowledge critically depends on natural language comprehension and production. Natural language concepts guide the interpretation of what we see, hear, read, or experience with other senses. In the first part of the paper, we illustrate the needed capabilities of cooperative dialog systems with a detailed example: the interaction between a customer and a clerk at an information desk in a train station. It is shown, that natural language systems cannot just rely on knowledge about syntactical and semantical aspects of language but also have to exploit conceptual and inferential knowledge, and a user model. In the remainder, we analyze and evaluate three natural language systems which were introduced to the commercial market in 1985: Language Craft ™ by
Event%2Dbased lossy compression for effective and efficient OLAP over data streams.

A top%2Ddown approach for compressing data cubes under the simultaneous evaluation of multiple hierarchical range queries.

The First International Conference on Advances in Databases
Most database applications are designed according the ANSI/SPARC architecture. When it is used, a large amount of semantics of data may be lost during the transformation from the conceptual model to a logical model. As a consequence exchanging/integrating various databases or generating user interfaces for data access become difficult. Ontologies seem an interesting solution to solve these problems, since they allow making explicit the semantics of data. In this paper, we propose an ontology-based approach for designing database applications, and then, for representing explicitly the semantics of data within the database. It consists in extending the ANSI/SPARC architecture with the ontological level. Note that this extension may also be added to existing applications designed according to the ANSI/SPARC architecture, since it preserves an upward compatibility. 1
Cubing Algorithms for XML Data.

Reasoning on Incompleteness of Spatial Information for Effectively and Efficiently Answering Range Queries over Incomplete Spatial Databases.

s%2DOLAP Approximate OLAP Query Evaluation on Very Large Data Warehouses via Dimensionality Reduction and Probabilistic Synopses.

Privacy Preserving OLAP over Distributed XML Documents.

Delivering Semantics%2Daware Compressed OLAP Views in Mobile Environments with Hand%2DOLAP.

Clustering Relational Data A Transactional Approach.

Clustering Relational Data A Transactional Approach.

I%2DSQE A Query Engine for Answering Range Queries over Incomplete Spatial Databases.

EBC A Topology Control Algorithm for Achieving High QoS in Sensor Networks.
Abstract. Anovelapproach for achievinghighQuality of Service (QoS) in sensor networks via topology control is introduced and experimentally assessed in this paper. Our approach falls in the broader discipline of graph structural mining, and exploits a leading concept initially studied in the context of Social Network Analysis (SNA), namely betweenness. Particularly, in our research betweenness is applied in terms of a graph structural mining measure embedded in the core layer of our proposed topology control algorithm, called Edge Betweenness Centrality (EBC). EBC allows us to evaluate relationships between entities of the network (e.g., nodes, edges), and hence identify different roles among them (e.g., brokers, outliers). In turn, deriving knowledge is further exploited to define raking operators that look at structural properties of the graph modeling the target sensor network. Based on these amenities, our topology control algorithm is able of providing an “insight ” of the graph structure of the network on top which control over information flow, message delivery, latency and energy dissipation among nodes can be easily deployed.
Histogram%2Dbased Compression of Massive High%2DDimensional OLAP Data Cubes.

Privacy Preserving OLAP by Sampling.

Fragmenting very large XML data warehouses via K%2Dmeans clustering algorithm.

Enabling OLAP in mobile environments via intelligent data cube compression techniques.

Multiple%2DObjective Compression of Data Cubes in Cooperative OLAP Environments.

Towards Real%2DTime Data Transformation Services over Grids.

A Probabilistic Approach for Computing Approximate Iceberg Cubes.

High%2DPerformance Data Management and Efficient Aggregate Query Answering on Environmental Sensor Networks by Computational Grids.

A Robust Sampling%2DBased Framework for Privacy Preserving OLAP.

Experimenting the Query Performance of a Grid%2DBased Sensor Network Data Warehouse.

A Process%2DDriven Methodology for Continuous Information Systems Modeling.

H%2DIQTS a semantics%2Daware histogram for compressing categorical OLAP data.

Top%2DDown Compression of Data Cubes in the Presence of Simultaneous Multiple Hierarchical Range Queries.


Event%2DBased Compression and Mining of Data Streams.




Compressing Data Cubes in the Presence of Simultaneous Multiple OLAP Queries.

Grid%2DVirtuE A Layered Architecture for Grid Virtual Enterprises.

Efficient Fragmentation of Large XML Documents.

Synopsis Data Structures for XML Databases Models

An OLAM%2DBased Framework for Complex Knowledge Pattern Discovery in Distributed%2Dand%2DHeterogeneous%2DData%2DSources and Cooperative Information Systems.

XlPPX A Lightweight Framework for Privacy Preserving P2P XML Databases in Very Large Publish%2DSubscribe Systems.

MRE%2DKDD  A Multi%2DResolution

A Query%2DStrategy%2DFocused Taxonomy and a Customizable Benchmarking Framework for Peer%2Dto%2DPeer Information Retrieval Techniques.

Advanced OLAP Visualization of Multidimensional Data Cubes A Semantics%2DDriven Compression Approach.

Semantics%2DAware Advanced OLAP Visualization of Multidimensional Data Cubes.

Approximate range%2Dsum query answering on data cubes with probabilistic guarantees.

Fragmenting XML Documents via Structural Constraints.

A Hierarchy%2DDriven Compression Technique for Advanced OLAP Visualization of Multidimensional Data Cubes.

On Semantically%2DAugmented XML%2DBased P2P Information Systems.

Towards a Lightweight Framework for Privacy Preserving P2P XML Databases.


An accuracy%2Daware compression technique for multidimensional data cubes.


Accuracy Control in Compressed Multidimensional Data Cubes for Quality of Answer%2Dbased OLAP Tools.

Improving range%2Dsum query evaluation on data cubes via polynomial approximation.

Storing and retrieving XPath fragments in structured P2P networks.

Combining multidimensional user models and knowledge representation and management techniques for making web services knowledge%2Daware.

Providing probabilistically%2Dbounded approximate answers to non%2Dholistic aggregate range queries in OLAP.

Overcoming Limitations of Approximate Query Answering in OLAP.

A Distributed System for Answering Range Queries on Sensor Network Data.

TP%2DTree a Query Workload%2DAdaptive Synopsis for Fast OLAP Applications.

Towards a Semantics%2DBased Framework for KD%2D and IR%2Dstyle Resource Querying on XML%2DBased P2P Information Systems.

Analytical Synopses for Approximate Query Answering in OLAP Environments.

Answering Approximate Range Aggregate Queries on OLAP Data Cubes with Probabilistic Guarantees.

Enriching Conceptual Modeling of XML%2DAware Adaptive Web Systems with Object%2DOriented Constructs and UML Diagrams.

Pushing Knowledge Management in Web Information Systems Engineering.

Distributed Knowledge Networks Towards a New Paradigm for Delivering Knowledge.

A Grid Framework for Approximate Aggregate Query Answering on Summarized Sensor Network Readings.
The problem of representing and querying sensor-network  data issues new research challenges, as traditional techniques and  architectures used for managing relational and object oriented databases  are not suitable in this context. In this paper we present a  Grid-based architecture that supports aggregate query answering on  sensor network data, and uses a summarization technique to efficiently  accomplish this task. In particular, grid nodes are used either  to collect, compress and store sensor readings, and to extract information  from stored data. Grid nodes can exchange information  among each other, so that the same piece of information can be  stored (with a different degree of accuracy) into several nodes. Queries  are evaluated by locating the grid nodes containing the needed  information, and choosing (among these nodes) the most convenient  ones, according to a cost model.
An Analytical Approach for Providing Approximate Answers to Aggregate Queries on Bi%2DDimensional OLAP Data Cubes.

XPath lookup queries in P2P networks.
We address the problem of querying XML data over a P2P network. In P2P networks, the allowed kinds of queries are usually exact-match queries over file names. We discuss the extensions needed to deal with XML data and XPath queries. A single peer can hold a whole document or a partial/complete fragment of the latter. Each XML fragment/document is identified by a distinct path expression, which is encoded in a distributed hash table. Our framework differs from content-based routing mechanisms, biased towards finding the most relevant peers holding the data. We perform fragments placement and enable fragments lookup by solely exploiting few path expressions stored on each peer. By taking advantage of quasi-zero replication of global catalogs, our system supports fast full and partial XPath querying. To this purpose, we have extended the Chord simulator and performed an experimental evaluation of our approach.
Knowledge on the Web Making Web Services Knowledge%2DAware.

A Pruning Algorithm for Improving Web Resources Searching and Classification in Knowledge Management%2DBased Web Systems.

Hand%2DOLAP A System for Delivering OLAP Services on Handheld Devices.

Approximate Query Answering on Sensor Network Data Streams.

A Reference Architecture for Knowledge Management%2DBased Web Systems.

XAHM an adaptive hypermedia model based on XML.

A Multidimensional Approach for Modelling and Supporting Adaptive Hypermedia Systems.

A Probabilistic Adaptive Hypermedia System.
Adaptive Hypermedia Systems allow user-driven access to information and services and content personalization. This paper presents the design and development of a Probabilistic Adaptive Hypermedia System that uses a probabilistic approach for user modelling and presentation adaptation. The Application Domain is modelled along three different adaptivity dimensions: user’s behaviour (browsing activity), technology (network and user’s terminal constraints), and external environment (time, location, language, socio-political issues, etc.). The user’s behaviour is modelled using a probabilistic approach and the most promising profile, that is a “view ” over the application domain, is dynamically assigned to the user, using a discrete probability density function. A modular architecture implementing both the authoring phase and the run-time support of the Adaptive Hypermedia System is also presented. 1.
